Isomorphic components of Kronecker product of bipartite graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isomorphic components of Kronecker product of bipartite graphs

Weichsel (Proc. Amer. Math. Soc. 13 (1962), 47-52) proved that the Kronecker product of two connected bipartite graphs consists of two connected components. A condition on the factor graphs is presented which ensures that such components are isomorphic. It is demonstrated that several familiar and easily constructible graphs are amenable to that condition. A partial converse is proved for the a...

متن کامل

Isomorphic components of direct products of bipartite graphs

A standard result states the direct product of two connected bipartite graphs has exactly two components. Jha, Klavžar and Zmazek proved that if one of the factors admits an automorphism that interchanges partite sets, then the components are isomorphic. They conjectured the converse to be true. We prove the converse holds if the factors are square-free. Further, we present a matrix-theoretic c...

متن کامل

Pseudo 2-factor isomorphic regular bipartite graphs

A graph is pseudo 2–factor isomorphic if the numbers of circuits of length congruent to zero modulo four in each of its 2–factors, have the same parity. We prove that there exist no pseudo 2–factor isomorphic

متن کامل

Giant components in Kronecker graphs

Let n ∈ N, 0 < α, β, γ < 1. Define the random Kronecker graph K(n, α, γ, β) to be the graph with vertex set Z2 , where the probability that u is adjacent to v is given by pu,v = α u·vγ(1−u)·(1−v)βn−u·v−(1−u)·(1−v). This model has been shown to obey several useful properties of real-world networks. We establish the asymptotic size of the giant component in the random Kronecker graph.

متن کامل

Isomorphic factorization, the Kronecker product and the line digraph

In this paper, we investigate isomorphic factorizations of the Kronecker product graphs. Using these relations, it is shown that (1) the Kronecker product of the d-out-regular digraph and the complete symmetric digraph is factorized into the line digraph, (2) the Kronecker product of the Kautz digraph and the de Bruijn digraph is factorized into the Kautz digraph, (3) the Kronecker product of b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discussiones Mathematicae Graph Theory

سال: 1997

ISSN: 1234-3099,2083-5892

DOI: 10.7151/dmgt.1057